Index verborum Propertianus. Ioannes S. Phillimore

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

S-Index: A Comprehensive Scholar Impact Index

Limitations of impact indices to compare scholars across disciplines and time based only the number of publications and citations are discussed. The S-index, based on more comprehensive scholar impact factors, is proposed.

متن کامل

INDEX S . No . Name

Introduction: A comparative study of blood cross match between gel card technique and conventional tube method wasundertaken on approx 1000 sample conducted in Sanjay Gandhi Memorial Hospital ,Rewa associated with Shyam shahmedical college Rewa .Material & Methods: most commonly conventional tube method are used widly. Now new technique of cross matching isintroduced . In th...

متن کامل

s-Vertex Pancyclic Index

A graph G is vertex pancyclic if for each vertex v ∈ V (G), and for each integer k with 3 ≤ k ≤ |V (G)|, G has a k-cycle Ck such that v ∈ V (Ck). Let s ≥ 0 be an integer. If the removal of at most s vertices in G results in a vertex pancyclic graph, we say G is an s-vertex pancyclic graph. Let G be a simple connected graph that is not a path, cycle or K1,3. Let l(G) = max{m : G has a divalent p...

متن کامل

The s-Hamiltonian index

For integers k, s with 0 ≤ k ≤ s ≤ |V (G)| − 3, a graph G is called s-Hamiltonian if the removal of any k vertices results in a Hamiltonian graph. For a simple connected graph that is not a path, a cycle or a K1,3 and an integer m ≥ 0, we define hs(G) = min{m : L(G) is s-Hamiltonian} and l(G) = max{m : G has an arc of length m that is not both of length 2 and in a K3}, where an arc in G is a pa...

متن کامل

Index-Based R-S Similarity Joins

Similarity Joins are some of the most useful and powerful data processing operations. They retrieve all the pairs of data points between different data sets that are considered similar within a certain threshold. This operation is useful in many situations, such as record linkage, data cleaning, and many other applications. An important method to implement efficient Similarity Joins is the use ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Classical Philology

سال: 1907

ISSN: 0009-837X,1546-072X

DOI: 10.1086/359021